Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
441	Bandwidth Approximation of a Restricted Family of Trees Abstract Bandwidth is one of the canonical NP-complete problemsIt is NP-hard to approximate within any constant, even on treesGupta gave a randomized Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2009-12-02 23:05:21 NP-complete problems Tree Clique Path decomposition Graph coloring Graph theory Theoretical computer science Mathematics
442	The Fascinating World of Graph Theory Add to Reading List Source URL: press.princeton.edu Language: English - Date: 2014-12-29 11:48:37 Graph coloring Perfect graph Edge coloring Graph theory Graph Planar graph
443	An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs Jon Kleinberg ∗ Abstract Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2005-08-11 23:51:43 Tree Graph coloring Minor Path decomposition Planar separator theorem Graph theory Graph operations Planar graph
444	Department of Electrical and Computer Systems Engineering Technical Report MECSE Add to Reading List Source URL: www.ecse.monash.edu.au Language: English - Date: 2007-01-19 23:16:10 Robot navigation Simultaneous localization and mapping Induced path Clique Matching Shortest path problem Graph Graph coloring Graph theory Mathematics Theoretical computer science
445	arXiv:1408.3590v1 [cs.DS] 15 AugComplexity of Nondeterministic Graph Parameter Testing Marek Karpinski∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-08-17 20:53:27 Ordinary differential equations Lemmas Szemerédi regularity lemma Graph coloring Euler–Lagrange equation Algorithmic version for Szemerédi regularity partition Approximately finite dimensional C*-algebra Mathematics Graph theory Theoretical computer science
446	Algorithms CS 6820 Fall 2009 Problem Set 5 Due November 11, 2009 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-10-30 17:40:59 Graph operations Connectivity Tree decomposition Graph Travelling salesman problem Tree Line graph Chordal graph Graph theory NP-complete problems Graph coloring
447	Timothy Y. Chow Citizenship: USA http://alum.mit.edu/www/tchow WORK EXPERIENCE Add to Reading List Source URL: math.mit.edu Language: English - Date: 2014-07-03 22:09:27 Algebraic combinatorics Combinatorics Matroid Graph theory Quasisymmetric function Combinatorica Graph coloring Young tableau Oriented matroid Mathematics Abstract algebra Algebra
448	SOME OF MY FAVOURITE PROBLEMS IN NUMBER THEORY, COMBINATORICS, AND GEOMETRY ˝s Paul Erdo To the memory of my old friend Professor George Sv´ Add to Reading List Source URL: www.ime.usp.br Language: English - Date: 2013-07-03 12:22:26 Integer sequences Prime number Probabilistic method Factorial Summation Sidon sequence Partition Prime gap Graph coloring Mathematics Number theory Combinatorics
449	A Stable Graph-Based Representation for Object Recognition through High-Order Matching A. Albarelli, F. Bergamasco, L. Rossi, S. Vascon and A. Torsello Universit`a Ca’ Foscari Venezia www.dais.unive.it Abstract Add to Reading List Source URL: www.cs.bham.ac.uk Language: English - Date: 2015-03-30 09:03:51 Vertex Nearest neighbor graph Object recognition Graph coloring Graph operations Edge coloring Graph theory Graph Matching
450	Bounding χ in terms of ω and ∆ for quasi-line graphs Andrew King and Bruce Reed May 8, 2007 Abstract A quasi-line graph is a graph in which the neighbourhood of any vertex Add to Reading List Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com Language: English - Date: 2015-03-20 01:35:25 Line graph Clique Graph coloring Interval graph Neighbourhood Path decomposition Chordal graph Graph theory Graph operations NP-complete problems

UPDATE